Separated finitely supported $Cb$-sets

نویسندگان

  • Mojgan Mahmoudi Department of Mathematics, Shahid Beheshti University, Tehran 19839, Iran.
چکیده مقاله:

The monoid $Cb$ of name substitutions and the notion of finitely supported $Cb$-sets introduced by Pitts as a generalization of nominal sets. A simple finitely supported $Cb$-set is a one point extension of a cyclic nominal set. The support map of a simple finitely supported $Cb$-set is an injective map. Also, for every two distinct elements of a simple finitely supported $Cb$-set, there exists an element of the monoid $Cb$ which separates them by making just one of them into an element with the empty support.In this paper, we generalize these properties of simple finitely supported $Cb$-sets by modifying slightly the notion of the support map; defining the notion of $mathsf{2}$-equivariant support map; and introducing the notions of s-separated and z-separated finitely supported $Cb$-sets. We show that the notions of s-separated and z-separated coincide for a finitely supported $Cb$-set whose support map is $mathsf{2}$-equivariant. Among other results, we find a characterization of simple s-separated (or z-separated) finitely supported $Cb$-sets. Finally, we show that some subcategories of finitely supported $Cb$-sets with injective equivariant maps which constructed applying the defined notions are reflective.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dening Finitely Supported Mathematics over Sets with Atoms

This paper presents some steps of defining a finitely supported mathematics by using sets with atoms. Such a mathematics generalizes the classical Zermelo-Fraenkel mathematics, and represents an appropriate framework to work with (infinite) structures in terms of finitely supported objects. We focus on the techniques of translating the Zermelo-Fraenkel results to this finitely supported mathema...

متن کامل

Finitely WellPositioned Sets

We introduce and study …nitely well-positioned sets, a class of asymptotically “narrow”sets that generalize the well-positioned sets recently investigated by Adly, Ernst and Thera [1] and [3], as well as the plastering property of Krasnoselskii [11].

متن کامل

Intersecting Families of Separated Sets

A set A ⊆ {1, 2, . . . , n} is said to be k-separated if, when considered on the circle, any two elements of A are separated by a gap of size at least k. We prove a conjecture due to Holroyd and Johnson [3],[4] that an analogue of the Erdős-Ko-Rado theorem holds for k-separated sets. In particular the result holds for the vertex-critical subgraph of the Kneser graph identified by Schrijver [7],...

متن کامل

Kinematic Synthesis for Finitely Separated Positions Using Geometric Constraint Programming

This paper presents an original approach to the kinematic synthesis of planar mechanisms for finitely separated positions. The technique, referred to here as geometric constraint programming, uses the sketching mode of commercial parametric computer-aided design software to create kinematic diagrams. The elements of these diagrams are parametrically related so that when a parameter is changed, ...

متن کامل

Finitely Based, Finite Sets of Words

For W a finite set of words, we consider the Rees quotient of a free monoid with respect to the ideal consisting of all words that are not subwords of W . This monoid is denoted by S(W ). It is shown that for every finite set of words W , there are sets of words U ⊃ W and V ⊃ W such that the identities satisfied by S(V ) are finitely based and those of S(U) are not finitely based (regardless of...

متن کامل

Computing Maximally Separated Sets in the Plane

Let S be a set of n points in R2. Given an integer 1 ≤ k ≤ n, we wish to find a maximally separated subset I ⊆ S of size k; this is a subset for which the minimum among the (k 2 ) pairwise distances between its points is as large as possible. The decision problem associated with this problem is to determine whether there exists I ⊆ S, |I| = k, so that all (k 2 ) pairwise distances in I are at l...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 13  شماره 1

صفحات  55- 82

تاریخ انتشار 2020-07-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023